A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem
نویسندگان
چکیده
منابع مشابه
A branch-price-and-cut method for the min-max k-windy rural postman problem
Given the edges of a graph, the postman problem consists of determining for a vehicle (postman) a shortest route that traverses all edges at least once. Each edge can be traversed in either direction and, when an edge is traversed more than once, the vehicle is said to be deadheading after its first traversal. The rural postman problem is the same as the postman problem except that the edges ar...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA branch-and-price algorithm for the windy rural postman problem
In this paper, we propose an exact solution method for the Windy Rural Postman Problem (WRPP). The motivation to study this problem comes from some real-life applications, such as garbage collecting in a predefined sector with hills, where the traversing or the servicing speed can change following the direction. We present a Dantzig-Wolfe decomposition and a branch-and-price algorithm to solve ...
متن کاملA Genetic Algorithm for the Undirected Rural Postman Problem
This paper introduces a new method to deal with the Undirected Rural Postman Problem (RPP), based on Genetic Algorithms. The RPP is a particular Arc Routing Problem which consists of determining a minimum cost circuit on a graph so that it is possible to traverse a given subset of required edges. The RPP is known to be an NP-hard problem and it has some interesting real-life applications. The a...
متن کاملNew facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem
In this paper the Min-Max version of the Windy Rural Postman Problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of balanced tours for the vehicles, we present here an ILP formulation and study its associated polyhedron. Based on its partial description, a branch-and-cut algorithm has been imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2018
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2017.0783